COMi ’ UTATlON OF THE - PSEUDOINVERSE OF , A MATRIX OF UNKNOWN RANK
نویسندگان
چکیده
-.m. , A program is described which computes the pseudoinverse, and oth:'3r related quantities, of an m X n matrix A of unknown rank. The program obtains least square solutions to singular and/or inconsistent linear systems Ax = B, where m 5 n or m > n and the rank of A ma.y be less than min(m,n). A complete description of the program and its use is given, including computational experience on a variety of problems0 -/ * On leave from Dept. of Mathematics and Computation Center, Buenos Aires University, Argentina. Reproduction in Whole or in part is Permitted for any Purpose of the United States Government. Prepared under NASA Grant Ns G 565 at Stanford University. Stanford California i
منابع مشابه
Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning large-scale overdetermined or underdetermined systems of linear equations. The computation is performed efficiently and stably based on the modified alternating least squares (MALS) schem...
متن کاملHigher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملRecurrent Neural Networks for Computing Pseudoinverses of Rank-Deficient Matrices
Three recurrent neural networks are presented for computing the pseudoinverses of rank-deficient matrices. The first recurrent neural network has the dynamical equation similar to the one proposed earlier for matrix inversion and is capable of Moore–Penrose inversion under the condition of zero initial states. The second recurrent neural network consists of an array of neurons corresponding to ...
متن کاملA method for solving fully fuzzy linear system
In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998